Joint Kernel Maps
نویسندگان
چکیده
We develop a methodology for solving high dimensional dependency estimation problems between pairs of data types, which is viable in the case where the output of interest has very high dimension, e.g. thousands of dimensions. This is achieved by mapping the objects into continuous or discrete spaces, using joint kernels. Known correlations between input and output can be defined by such kernels, some of which can maintain linearity in the outputs to provide simple (closed form) pre-images. We provide examples of such kernels and empirical results on mass spectrometry prediction and mapping between images.
منابع مشابه
Depth Map Enhancement Using Adaptive Steering Kernel Regression Based on Distance Transform
In this paper, we present a method to enhance noisy depth maps using adaptive steering kernel regression based on distance transform. Dataadaptive kernel regression filters are widely used for image denoising by considering spatial and photometric properties of pixel data. In order to reduce noise in depth maps more efficiently, we adaptively refine the steering kernel regression function accor...
متن کاملISAR Image Improvement Using STFT Kernel Width Optimization Based On Minimum Entropy Criterion
Nowadays, Radar systems have many applications and radar imaging is one of the most important of these applications. Inverse Synthetic Aperture Radar (ISAR) is used to form an image from moving targets. Conventional methods use Fourier transform to retrieve Doppler information. However, because of maneuvering of the target, the Doppler spectrum becomes time-varying and the image is blurred. Joi...
متن کاملReduction of JPEG Compression Artifacts by Kernel Regression and Probabilistic Self-Organizing Maps
There is a wide range of methods for lossy compression, but among those most used we find JPEG (Joint Photographic Experts Group) for still images. In this paper we present an intelligent system which is capable of restoring a compressed JPEG image by combining the knowledge extracted from the image domain and the transformed domain. It is based on probabilistic self-organizing maps and functio...
متن کاملHeteroscedastic Gaussian Kernel-Based Topographic Maps
Several learning algorithms for topographic map formation have been introduced that adopt overlapping activa-tion regions, rather than Voronoiregions, usually in the form of kernel functions. We review and introduce a numberof fixed point rules for training homogeneous, heteroscedastic but otherwise radially-symmetric Gaussian kernel-based topographic maps, or kernel topographic...
متن کاملOn Ascertaining Inductively the Dimension of the Joint Kernel of Certain Commuting Linear Operators
Given an index set X, a collection IB of subsets of X (all of the same cardinality), and a collection f`xgx2X of commuting linear maps on some linear space, the family of linear operators whose joint kernel K = K(IB) is sought consists of all `A :=Qa2A `a with A any subset of X which intersects every B 2 IB. The goal is to establish conditions, on IB and `, which ensure that dimK(IB) = X B2IBdi...
متن کامل